Asymptotic Analysis of Hoppe Trees
نویسندگان
چکیده
منابع مشابه
Asymptotic Analysis of Hoppe Trees
We introduce and analyze a random tree model associated to Hoppe’s urn. The tree is built successively by adding nodes to the existing tree when starting with the single root node. In each step a node is added to the tree as a child of an existing node where these parent nodes are chosen randomly with probabilities proportional to their weights. The root node has weight θ > 0, a given fixed par...
متن کاملAsymptotic Analysis of Self-Adjusting Contraction Trees
In this report, we analyze the asymptotic efficiency of self-adjusting contraction trees proposed as part of the Slider project [2, 3]. Self-adjusting contraction trees are used for incremental computation [1, 4, 5, 8]. Our analysis extends the asymptotic efficiency analysis of Incoop [6, 7]. We consider two different runs: the initial run of an Slider computation, where we perform a computatio...
متن کاملAn Asymptotic Analysis of Unlabeled k-Trees
In this paper we solve the asymptotic counting problem for unlabeled k-trees. By applying a proper singularity analysis of generating functions we show that the numbers Un of unlabeled k-trees of size n are asymptotically given by Un ∼ ckn(ρ1k) , where ck > 0 and ρ1k > 0 denotes the radius of convergence of the generating function U(z) = ∑ n≥0 Unz . Furthermore we prove that the number of leave...
متن کاملAsymptotic Cost of Cutting Down Random Free Trees
In this work, we calculate the limit distribution of the total cost incurred by splitting a tree selected at random from the set of all finite free trees. This total cost is considered to be an additive functional induced by a toll equal to the square of the size of tree. The main tools used are the recent results connecting the asymptotics of generating functions with the asymptotics of...
متن کاملAsymptotic Enumeration of Spanning Trees
We give new formulas for the asymptotics of the number of spanning trees of a large graph. A special case answers a question of McKay [Europ. J. Combin. 4 149–160] for regular graphs. The general answer involves a quantity for infinite graphs that we call ‘tree entropy’, which we show is a logarithm of a normalized determinant of the graph Laplacian for infinite graphs. Tree entropy is also exp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Probability
سال: 2013
ISSN: 0021-9002,1475-6072
DOI: 10.1017/s002190020001322x